Parallel processing of numerical transport algorithms

Topic 10: Parallel Numerical Algorithms

Since the early days of supercomputing, numerical routines have caused the highest demand for computing power anywhere, making their ecient paral-lelization one of the core methodical tasks in high-performance computing. And still, many of today's fastest computers in the world are mostly used for the solution of huge systems of equations as they arise in the simulation of complex large scale p...

Parallel Numerical Algorithms and Software

Parallel Numerical Algorithms: an Introduction

The rapidly evolving field of parallel computing has seen four eras, substantially overlapping, yet progressive. The first, which we could label the Stone Age, was characterized by having speed-up as its primary objective (" Solve my problem faster... "). The tyranny of Amdahl's Law, combined with architectural convergence to systems that added memory in fixed proportion to processors, led to t...

Topic 10: Parallel Numerical Algorithms

Efficient and robust parallel and distributed algorithms with portable and easy-to-use implementations for the solution of fundamental problems in numerical mathematics are essential components of most parallel software systems for scientific and engineering applications. This topic provides a forum for the presentation and discussion of new developments in the area of parallel and distributed ...

Parallel Processing Letters Fast Parallel Permutation Algorithms

We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p)logn) and an improved algorithm with run time O(n/p+logn loglog(n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If preex summation is supported at the instruction level, the run ti...